The least error method for sparse solution reconstruction
نویسندگان
چکیده
منابع مشابه
A Direct Decomposition Method for the Solution of Sparse Linear Least Squares Problems
SUMMARY Given a sparse nonsquare system of linear equations Mx = b where M T M is either dense or full, we present a direct method that generates a least squares solution of the original system Mx = b by solving a smaller least squares problem. The method accomplishes this decomposition by applying orthogonal transformations to a restructured form of the original system of equations. The algori...
متن کاملFast Reconstruction of SAR Images with Phase Error Using Sparse Representation
In the past years, a number of algorithms have been introduced for synthesis aperture radar (SAR) imaging. However, they all suffer from the same problem: The data size to process is considerably large. In recent years, compressive sensing and sparse representation of the signal in SAR has gained a significant research interest. This method offers the advantage of reducing the sampling rate, bu...
متن کاملGeneralized Arnoldi-Tikhonov Method for Sparse Reconstruction
This paper introduces two new algorithms, belonging to the class of Arnoldi-Tikhonov regularization methods, which are particularly appropriate for sparse reconstruction. The main idea is to consider suitable adaptively-defined regularization matrices that allow the usual 2-norm regularization term to approximate a more general regularization term expressed in the p-norm, p ≥ 1. The regularizat...
متن کاملLeast Absolute Deviations Method For Sparse Signal Recovery
We consider a problem in signal processing which deals with the recovery of a high-dimensional sparse signal based on a small number of measurements. Our goal is to apply the least absolute deviations (LAD) method in an algorithm that would essentially follow the steps of the orthogonal matching pursuit (OMP) algorithm that has been used mostly in this setting. OMP can recover the signal with h...
متن کاملInexact trust region method for large sparse nonlinear least squares
The main purpose of this paper is to show that linear least squares methods based on bidiagonalization, namely the LSQR algorithm, can be used for generation of trust region path. This property is a basis for an inexact trust region method which uses the LSQR algorithm for direction determination. This method is very efficient for large sparse nonlinear least squares as it is supported by numer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inverse Problems
سال: 2016
ISSN: 0266-5611,1361-6420
DOI: 10.1088/0266-5611/32/9/094001